A problem of finding an acceptable variant in generalized project networks
نویسندگان
چکیده
منابع مشابه
A problem of finding an acceptable variant in generalized project networks
A project network often has some activities or groups of activities which can be performed at different stages of the project. Then, the problem of finding an optimal/acceptable time or/and optimal/acceptable order of such an activity or a group of activities arises. Such a problem emerges, in particular, in house-building management when the beginnings of some activities may vary in time or/an...
متن کاملA Problem of Nding an Acceptable Variant in Some Generalized Project Networks
A project network often has some activities or groups of activities which can be performed at diierent stages of the project. Then, the problem of nding an optimal time or/and optimal order of such an activity or a group of activities arises. Such problems emerge, in particular, in house-building management when the beginnings of some activities may vary in time or/and order. We consider a math...
متن کاملA discussion of the acceptable risk problem
The petroleum activities on the Norwegian Continental Shelf are subject to regulations issued by the Norwegian Petroleum Directorate. One important issue in these regulations is the use of acceptance criteria, and this paper discusses some philosophical aspects of acceptance criteria for risk, and the role of statistical decision theory within safety management. Statistical decision theory has ...
متن کاملdevelopment and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولAn Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics and Decision Sciences
سال: 2005
ISSN: 1173-9126,1532-7612
DOI: 10.1155/jamds.2005.75